Tina Bosner Knot insertion algorithms for Chebyshev splines
نویسندگان
چکیده
منابع مشابه
Variable degree polynomial splines are Chebyshev splines
Variable degree polynomial (VDP) splines have recently proved themselves as a valuable tool in obtaining shape preserving approximations. However, some usual properties which one would expect of a spline space in order to be useful in geometric modeling, do not follow easily from their definition. This includes total positivity (TP) and variation diminishing, but also constructive algorithms ba...
متن کاملNumerically Stable Algorithm for Cycloidal Splines
We propose a knot insertion algorithm for splines that are piecewisely in L{1, x, sin x, cos x}. Since an ECC–system on [0, 2π] in this case does not exist, we construct a CCC–system by choosing the appropriate measures in the canonical representation. In this way, a B-basis can be constructed in much the same way as for weighted and tension splines. Thus we develop a corner cutting algorithm f...
متن کاملB-splines with arbitrary connection matrices
We consider a space of Chebyshev splines whose left and right derivatives satisfy linear constraints that are given by arbitrary non-singular connection matrices. We show that for almost all knot sequences such spline spaces have basis functions whose support is equal to the support of the ordinary B-splines with the same knots. Consequently, there are knot insertion and evaluation algorithms a...
متن کاملBasis of splines associated with singularly perturbed advection – diffusion problems ∗
Among fitted-operator methods for solving one-dimensional singular perturbation problems one of the most accurate is the collocation by linear combinations of {1, x, exp (±px)}, known as tension spline collocation. There exist well established results for determining the ‘tension parameter’ p, as well as special collocation points, that provide higher order local and global convergence rates. H...
متن کاملDiscrete GB-Splines and Their Properties
Discrete generalized splines are continuous piecewise defined functions which meet some smoothness conditions for the first and second divided differences at the knots. Direct algorithms and recurrence relations are proposed for constructing discrete generalized B-splines (discrete GB-splines for short). Properties of discrete GB-splines and their series are studied. It is shown that discrete G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006